package com.data;

import java.util.HashMap;
import java.util.LinkedList;
import java.util.PriorityQueue;
import java.util.concurrent.ConcurrentHashMap;
import java.util.concurrent.ConcurrentLinkedQueue;

/**
 * @author dell
 */
public class QueueList {

    private String status;

    private static final int length = 100;


    public static void main(String[] args) {

        LinkedList linkedList  = new LinkedList();

        HashMap hashMap = new HashMap();

        HashMap<Integer, Integer> map = new HashMap<Integer, Integer>();

        //ConcurrentHashMap 虽然线程安全， 但是插入效率和查询比HashMap低。
        ConcurrentHashMap concurrentHashMap = new ConcurrentHashMap();
        concurrentHashMap.put("老曹", "理解");

        concurrentHashMap.size();

        hashMap.put("test","success");

        PriorityQueue priorityQueue = new PriorityQueue();

        ConcurrentLinkedQueue concurrentLinkedQueue = new ConcurrentLinkedQueue();


        // "3" ==>  00000011;
        // "99" ==> 01100011;

        int num = 3 & (length-1); // num 结果为3
        int num1 = 3 | (length-1); // 结果为99
        System.out.println(3^99);

        System.out.println(3 % length);


    }

}
